Can Paraconsistency Replace Non-Monotonicity?
نویسندگان
چکیده
In this position paper we reconstruct and evaluate three arguments by Jean-Yves Béziau put forward to show that paraconsistent logics may replace non-monotonic logics in the analysis of situations what the latter were created for, namely updating of databases by increment of information. As originally put forward they might seem too colorful or unserious and easily dismissible, but they really call into question the foundations of non-monotonic logic. We will show that non-monotonic logic may go off well of Béziau’s challenging arguments, though.
منابع مشابه
A machine-assisted view of paraconsistency
For a newcomer, paraconsistent logics can be difficult to grasp. Even experts in logic can find the concept of paraconsistency to be suspicious or misguided, if not actually wrong. The problem is that although they usually have much in common with more familiar logics (such as intuitionistic or classical logic), paraconsistent logics necessarily disagree in other parts of the logical terrain wh...
متن کاملMaximal and Premaximal Paraconsistency in the Framework of Three-Valued Semantics
Maximality is a desirable property of paraconsistent logics, motivated by the aspiration to tolerate inconsistencies, but at the same time retain from classical logic as much as possible. In this paper we introduce the strongest possible notion of maximal paraconsistency , and investigate it in the context of logics that are based on deterministic or non-deterministic three-valued matrices. We ...
متن کاملInformation, Negation, and Paraconsistency
This paper begins by arguing that a truth conditional approach to the semantics for relevant logic is unnatural. Rather, we should adopt an informational semantics. On this view, the indices in the RoutleyMeyer semantics are situations, which can be said either to contain or not contain, particular pieces of information. Valid inference, then, is seen as information preservation, not truth pres...
متن کاملParaconsistency in the semantics of integrity constraints
Deductive databases are paraconsistent theory systems which change over time. They do not support the inference of arbitrary consequences from inconsistent components, such as contradictory definitions of database relations (predicates) or violated integrity constraints. Moreover, computed answers in deductive databases typically make sense, almost no matter to which degree consistency or integ...
متن کاملOn Discourses Addressed by Infidel Logicians
We attempt to address here some alleged criticisms against the philosophical import of the so-called Brazilian approach to paraconsistency, especially by providing some demanded epistemic elucidations to the whole enterprise of the logics of formal inconsistency. In the way of elucidating, we substantiate the view that difficulties in reasoning under contradictions in both the Buddhist and the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009